Hochschild homology, and a persistent approach via connectivity digraphs

Abstract We introduce a persistent Hochschild homology framework for directed graphs. groups of (path algebras of) graphs vanish in degree $$i\ge 2$$ i ≥ 2 . To extend them to higher degrees, we the notion connectivity digraphs , and analyse two main examples; first, arising from Atkin’s q -connectivity, second, here called n -path generalising classical line graph. Based on categorical setting homology, propose stable pipeline computing groups. This is also amenable other theories; this reason, complement our work with survey theories